checkable
Смотреть что такое "checkable" в других словарях:
checkable — adjective Date: 1877 1. capable of being checked < a checkable story > 2. held in or being a bank account on which checks can be drawn < checkable deposits > … New Collegiate Dictionary
checkable — checkability, n. /chek euh beuhl/, adj. 1. capable of being checked, as by inquiry or verification: The fact is checkable from available records. 2. (of money deposited in a bank) capable of being withdrawn by bank check: a checkable account.… … Universalium
checkable — Ⅰ. check [1] ► VERB 1) examine the accuracy, quality, or condition of. 2) stop or slow the progress of. 3) Chess move a piece or pawn to a square where it directly attacks (the opposing king). ► NOUN 1) an examination to check accuracy, quality,… … English terms dictionary
checkable — ˈchekəbəl adjective 1. : capable of being checked a checkable statement 2. : suitable for being checked on a passenger ticket checkable baggage … Useful english dictionary
Checkable Deposits — Any demand deposit account against which checks or drafts of any kind may be written. Checkable deposit accounts include checking, savings and money market accounts. They also include any kind of negotiable draft, such as a Negotiable Order of… … Investment dictionary
checkable — adjective Able to be checked or verified … Wiktionary
checkable — adj. capable of being verified, confirmable; stoppable, controllable … English contemporary dictionary
checkable — check·a·ble … English syllables
checkable — check (chĕk) n. 1. a) The act or an instance of inspecting or testing something, as for accuracy or quality: »gave the paper a final check. b) A standard for inspecting or evaluating; a test: »The condition of the wiring can serve as a check for… … Word Histories
checkable — / tʃekəb(ə)l/ adjective US referring to a deposit account on which checks can be drawn … Dictionary of banking and finance
Probabilistically checkable proof — In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof. The algorithm… … Wikipedia